Computing the Largest Empty Rectangle
نویسندگان
چکیده
منابع مشابه
Computing the Largest Empty Rectangle
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] ...
متن کاملComputing the largest inscribed isothetic rectangle
This paper describes an algorithm to compute, in (log n) time, a rectangle that is contained in a convex n-gon, has sides parallel to the coordinate axes, and has maximum area. With a slight modiication it will compute the smallest perimeter. The algorithm uses a tentative prune-and-search approach, even though this problem does not appear to t into the functional framework of Kirkpatrick and S...
متن کاملInplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle
There is a high demand of space-efficient algorithms in builtin or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region R in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of n points in R using O(logn) ...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملFinding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases
Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the minimum rectangle containing the elements of S, and let q be a query point such that q / ∈ S and R ∩ q 6= ∅. In this paper, we present an algorithm for finding the empty rectangle with the largest area, sides parallel to the axes of the space, and containing only the query point q. The idea behind algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215022